The algebra of metric betweenness II: Geometry and equational characterization of weakly median graphs

نویسندگان

  • Hans-Jürgen Bandelt
  • Victor Chepoi
چکیده

We elaborate on the convexity properties of (not necessarily finite) weakly median graphs and their prime constituents in order to establish a number of equations in terms of the weakly median operation. Then the weakly median graphs can be identified with the discrete members of an equational class of ternary algebras satisfying five independent axioms on two to four points. This demonstrates that the median algebras featured by Avann and Sholander half a century ago and, more generally, Isbell’s isotropic media can be generalized much further, without losing the close ties with graphs.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The algebra of metric betweenness I: Subdirect representation and retraction

We bring together algebraic concepts such as equational class and various concepts from graph theory for developing a structure theory for graphs that promotes a deeper analysis of their metric properties. The basic operators are Cartesian multiplication and gated amalgamation or, alternatively, retraction. Specifically, finite weakly median graphs are known to be decomposable (relative to thes...

متن کامل

A CHARACTERIZATION FOR METRIC TWO-DIMENSIONAL GRAPHS AND THEIR ENUMERATION

‎The textit{metric dimension} of a connected graph $G$ is the minimum number of vertices in a subset $B$ of $G$ such that all other vertices are uniquely determined by their distances to the vertices in $B$‎. ‎In this case‎, ‎$B$ is called a textit{metric basis} for $G$‎. ‎The textit{basic distance} of a metric two dimensional graph $G$ is the distance between the elements of $B$‎. ‎Givi...

متن کامل

Dually quasi-De Morgan Stone semi-Heyting algebras II. Regularity

This paper is the second of a two part series. In this Part, we prove, using the description of simples obtained in Part I, that the variety $mathbf{RDQDStSH_1}$ of regular dually quasi-De Morgan Stone semi-Heyting algebras of level 1 is the join of the variety generated by the twenty 3-element $mathbf{RDQDStSH_1}$-chains and the variety of dually quasi-De Morgan Boolean semi-Heyting algebras--...

متن کامل

Dually quasi-De Morgan Stone semi-Heyting algebras I. Regularity

This paper is the first of a two part series. In this paper, we first prove that the variety of dually quasi-De Morgan Stone semi-Heyting algebras of level 1 satisfies the strongly blended $lor$-De Morgan law introduced in cite{Sa12}. Then, using this result and the results of cite{Sa12}, we prove our main result which gives an explicit description of simple algebras(=subdirectly irreducibles) ...

متن کامل

Decomposition andl1-Embedding of Weakly Median Graphs

Weakly median graphs, being defined by interval conditions and forbidden induced subgraphs, generalize quasi-median graphs as well as pseudo-median graphs. It is shown that finite weakly median graphs can be decomposed with respect to gated amalgamation and Cartesian multiplication into 5-wheels, induced subgraphs of hyperoctahedra (alias cocktail party graphs), and 2-connected bridged graphs n...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Eur. J. Comb.

دوره 29  شماره 

صفحات  -

تاریخ انتشار 2008